A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
نویسندگان
چکیده
We develop a model-checking algorithm for a logic that permits propositions to be deened using greatest and least xed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identiied by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and behavioral preorders. Our algorithm determines whether a process satisses a formula in time proportional to the product of the sizes of the process and the formula; this improves on the best known algorithm for similar xed-point logics.
منابع مشابه
Incremental Model Checking in the Modal Mu-Calculus
We present an incremental algorithm for model checking in the alternation free fragment of the modal mu-calculus, the rst incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a linear-time algorithm due to Cleaveland and Steeen that performs global (non-incremental) computation of xed points. MCI ta...
متن کاملModel Checking for Context-Free Processes
We develop a model-checking algorithm that decides for a given context-free process whether it satisses a property written in the alternation-free modal mu-calculus. The central idea behind this algorithm is to raise the standard iterative model-checking techniques to higher order: in contrast to the usual approaches, in which the set of formulas that are satissed by a certain state are iterati...
متن کاملModel Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, that decides the full modal mu-calculus. Whereas the actual model checking algorithm results from considering conditional semantics together with backtracking caused by alternation, the corresponding correctness proof req...
متن کاملLocal Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus
Programs written in value-passing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we deene a value-based alternation-free modal-calculus built from typed variables, pattern-matching modalities, and parameterised xed point operators. The ver...
متن کاملEfficient Graph-based Algorithms for Model Checking in the Modal Mu-calculus Abstract of the Dissertation Eecient Graph-based Algorithms for Model Checking in the Modal Mu-calculus
of the Dissertation E cient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus by Oleg Sokolsky Doctor of Philosophy in Computer Science State University of New York at Stony Brook 1996 Various model-checking algorithms for the alternation-free subset of the modal mu-calculus are considered. The algorithms are based on a data structure called the product graph, which represents ...
متن کامل